Inequality systems and minimax results without linear structure

Relaxation Methods for Solving Linear Inequality Systems: Converging Results

The problem of finding a feasible solution to a linear inequality system arises in numerous contexts. In [12] an algorithm, called extended relaxation method, that solves the feasibility problem, has been proposed by the authors. Convergence of the algorithm has been proven. In this paper, we consider a class of extended relaxation methods depending on a parameter and prove their convergence. N...

Minimax state estimation for linear descriptor systems

Minimax state estimation for linear descriptor systems 01.05.04 – system analysis and optimal decision theory Author's Summary of the dissertation for the degree of the Candidate of Science (physics and mathematics)

Explicit ABS Solution of a Class of Linear Inequality Systems and LP Problems

Some Results on facets for linear inequality in 0-1 variables

The facet of Knapsack ploytope, i.e. convex hull of 0-1 points satisfying a given linear inequality has been presented in this current paper. Such type of facets plays an important role in set covering set partitioning, matroidal-intersection vertex- packing, generalized assignment and other combinatorial problems. Strong covers for facets of Knapsack ploytope has been developed in the first pa...

Newton's method for linear inequality systems

We describe a modified Newton type algorithm for the solution of linear inequality systems in the sense of minimizing the /, norm of infeasibilities. Finite termination is proved, and numerical results are given.